Solving linear and quadratic programs with an analog circuit
نویسندگان
چکیده
منابع مشابه
Solving linear and quadratic programs with an analog circuit
We present the design of an analog circuit which solves linear programming (LP) or Quadratic Programming (QP) problems. In particular, the steadystate circuit voltages are the components of the LP (QP) optimal solution. The paper shows how to construct the circuit and provides a proof of equivalence between the circuit and the LP (QP) problem. The proposed method is used to implement a LP-based...
متن کاملSolving semidefinite-quadratic-linear programs using SDPT3
This paper discusses computational experiments with linear optimization problems involving semidefinite, quadratic, and linear cone constraints (SQLPs). Many test problems of this type are solved using a new release of SDPT3, a Matlab implementation of infeasible primal-dual path-following algorithms. The software developed by the authors uses Mehrotratype predictor-corrector variants of interi...
متن کاملStability of an analog optimization circuit for quadratic programming
Westudy the stability of an analog optimization circuit that solves quadratic programming (QP) problems. The circuit dynamics are modeled as a switched affine system. A piece-wise quadratic Lyapunov function and the KYP lemma are used to derive the stability criterion. The stability criterion characterizes the range of critical circuit parameters for which the QP circuit is globally exponential...
متن کاملPrivately Solving Linear Programs
In this paper, we initiate the systematic study of solving linear programs under differential privacy. The first step is simply to define the problem: to this end, we introduce several natural classes of private linear programs that capture different ways sensitive data can be incorporated into a linear program. For each class of linear programs we give an efficient, differentially private solv...
متن کاملSolving Box-Constrained Nonconvex Quadratic Programs
We present effective computational techniques for solving nonconvex quadratic programs with box constraints (BoxQP). We first observe that cutting planes obtained from the Boolean Quadric Polytope (BQP) are computationally effective at reducing the optimality gap of BoxQP. We next show that the Chvátal-Gomory closure of the BQP is given by the odd-cycle inequalities even when the underlying gra...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computers & Chemical Engineering
سال: 2014
ISSN: 0098-1354
DOI: 10.1016/j.compchemeng.2014.01.011